Object Tracking via Tensor Kernel Space Projection
نویسندگان
چکیده
Although there has been significant progress in the past decade, object tracking under complex environment is still a very challenging task, due to the irregular changes in object appearance. To alleviate these problems, this research developed an object tracking algorithm via tensor kernel space projection. In the initial stage of tracking, a template matching algorithm was used to obtain a priori images of the appearance of the object. The steps taken were as follows: define the tensor kernel function based on a multi-linear singular value decomposition, view the object appearance color image as tensor data, calculate the kernel matrix for the priori appearance image samples, use KPCA to obtain the projection matrix of the image samples in kernel space, and finally, obtain an optimal estimate of the object state through Bayesian sequence interference. Meanwhile, the projection matrix in kernel space was updated on-line. Experiments on two real video surveillance sequences were conducted to evaluate the proposed algorithm against two classical tracking algorithms both qualitatively and quantitatively. Experimental results demonstrate that the proposed algorithm is robust in handing occlusion and object scale changes.
منابع مشابه
A Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملUsing a Novel Concept of Potential Pixel Energy for Object Tracking
Abstract In this paper, we propose a new method for kernel based object tracking which tracks the complete non rigid object. Definition the union image blob and mapping it to a new representation which we named as potential pixels matrix are the main part of tracking algorithm. The union image blob is constructed by expanding the previous object region based on the histogram feature. The pote...
متن کاملVisual Tracking using Kernel Projected Measurement and Log-Polar Transformation
Visual Servoing is generally contained of control and feature tracking. Study of previous methods shows that no attempt has been made to optimize these two parts together. In kernel based visual servoing method, the main objective is to combine and optimize these two parts together and to make an entire control loop. This main target is accomplished by using Lyapanov theory. A Lyapanov candidat...
متن کاملTensor subspace Tracking via Kronecker structured projections (TeTraKron) for time-varying multidimensional harmonic retrieval
We present a framework for Tensor-based subspace Tracking via Kronecker-structured projections (TeTraKron). TeTraKron allows to extend arbitrary matrix-based subspace tracking schemes to track the tensor-based subspace estimate. The latter can be computed via a structured projection applied to the matrix-based subspace estimate which enforces the multi-dimensional structure in a computationally...
متن کاملRobust visual tracking via speedup multiple kernel ridge regression
Most of the tracking methods try to build up feature spaces to represent the appearance of the target. However, limited by the complex structure of the distribution of features, the feature spaces constructed in a linear manner cannot characterize the nonlinear structure well. We propose an appearance model based on kernel ridge regression for visual tracking. Dense sampling is fulfilled around...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JCP
دوره 9 شماره
صفحات -
تاریخ انتشار 2014